Analytic Computation of End-to-end Delays in Queueing Networks with Batch Markovian Arrival Processes and Phase-type Service Times
نویسندگان
چکیده
This paper poposes an analytic approach to compute end-to-end delays in queueing networks composed of BMAP/PH/1 queues. The approximations for the first two moments of the end-to-end delays are based on corresponding moments for the delays at each node in the network. In a traffic-based decomposition of queueing networks, different techniques for the departure process approximation, including the ETAQA truncation, and traffic descriptions, like phase-type distributions and Markovian arrival processes (MAPs), have been implemented and are compared with simulation results. Extensions to networks with two classes of customers are also discussed.
منابع مشابه
The departure process of discrete-time queueing systems with Markovian type inputs
This paper proposes a unified matrix-analytic approach to characterize the output processes of general discrete-time lossless/lossy queueing systems in which time is synchronized/slotted into fixed length intervals called slots. The arrival process can be continuousor discrete-time Markovian processes. It can be either renewal or non-renewal. The service of a customer commences at the beginning...
متن کاملA matrix-analytic solution for the DBMAP/PH/1 priority queue
Abstract Priority queueing models have been commonly used in telecommunication systems. The development of analytically tractable models to determine their performance is vitally important. The discrete time batch Markovian arrival process (DBMAP ) has been widely used to model the source behavior of data traffic, while phase-type (PH) distribution has been extensively applied to model the serv...
متن کاملApproximate Analysis of Queueing Networks with Markovian Arrival Processes and Phase Type Service Times
Open queueing networks with Markovian arrival processes and phase type service times are considered. A technique is proposed for the speciication of the models. Using such a speciication, a Markov chain can be generated automatically. Furthermore, this description can be used immediately for simulation. An approximate disaggregation{aggregation technique for nite state Markov chains is applied....
متن کاملAnalysis of an Infinite-Server Queue with Batch Markovian Arrival Streams
This paper considers an infinite-server queue with multiple batch Markovian arrival streams. The service time distribution of customers may be different for different arrival streams, and simultaneous batch arrivals from more than one stream are allowed. For this queue, we first derive a system of ordinary differential equations for the time-dependent matrix joint generating function of the num...
متن کاملBlock-Structured Supermarket Models
Supermarket models are a class of parallel queueing networks with an adaptive control scheme that play a key role in the study of resource management of, such as, computer networks, manufacturing systems and transportation networks. When the arrival processes are non-Poisson and the service times are non-exponential, analysis of such a supermarket model is always limited, interesting, and chall...
متن کامل